Fast implementation of large erosions and dilations in Mamba
نویسنده
چکیده
Large structuring elements are used in many morphological transformations. They are needed when computing size distributions, in filtering operators (and especially in alternate sequential filters), for regularised gradients and large top-hat transforms, for residual operators (skeletons by openings, critical balls, ultimate openings and so on). Moreover, in some applications, images are large and even very large. Remind that Mamba is able to process images containing up to 16.10 pixels, value which corresponds for instance to a 4096x4096 pixels image. So, it is not unusual, when dealing with these images, to need very large erosions, dilations, openings or closings. Performing an ultimate opening on such an image may require the use of opening sizes up to 2000!
منابع مشابه
Hierarchical Queues: general description and implementation in MAMBA image library
Hierarchical queues (HQ) are extremely efficient structures for fast computation of morphological transformations such as watershed lines or geodesic reconstructions. The recent development of MAMBA, new morphological image processing library, led the authors of this paper to review the definition and implementation of the watersheds and geodesic reconstructions algorithms based on these hierar...
متن کامل3 D Binary Fast Morphological
In this paper the use of a fast algorithm for implementing shape decomposition of 3D binary objects is proposed. Shape decomposition is performed by successive 3D erosions and dilations, using 3D structuring elements of arbitrary size and shape. The proposed fast shape decomposition algorithm is based on a fast implementation of the basic morphological operation of Minkowski addition for the sp...
متن کاملRecursive Implementation of Erosions and Dilations Along Discrete Lines at Arbitrary Angles
Van Herk has shown that the erosion/dilation operator with a linear structuring element of an arbitrary length can be implemented in only 3 min/max operations per pixel. In this paper, the algorithm is generalized to erosions and dilations along discrete lines at arbitrary angles. We also address the padding problem; so that the operation can be performed in place without copying the pixels to ...
متن کاملA Constant-time Algorithm for Erosions/Dilations with Applications to Morphological Texture Feature Computation
A computationally ecient algorithm for computing erosions and dilations by onedimensional grayscale structuring elements with constant slope is proposed. The computational complexity of this algorithm is independent of the size of the support of the structuring function. This is a generalization of the method proposed by Van Herk for the case of erosion and dilation by ̄at one-dimensional struc...
متن کاملPartial Differential Equations for Morphological Operators
Two of G. Matheron’s seminal contributions have been his development of size distributions (else called ‘granulometries’) and his kernel representation theory. The first deals with semigroups of multiscale openings and closings of binary images (shapes) by compact convex sets, a basic ingredient of which are the multiscale Minkowski dilations and erosions. The second deals with representing inc...
متن کامل